Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
نویسندگان
چکیده
A semicomplete multipartite or semicomplete c-partite digraph D is a biorientation of a c-partite graph. A semicomplete multipartite digraph D is called strongly quasiHamiltonian-connected, if for any two distinct vertices x and y of D, there is a path P from x to y such that P contains at least one vertex from each partite set of D. In this paper we show that every 4-strong semicomplete multipartite digraph is strongly quasi-Hamiltonian-connected. This generalizes a result due to Thomassen for tournaments. © 2013 Elsevier B.V. All rights reserved.
منابع مشابه
Strongly connected spanning subgraphs with the minimum number of arcs in semicomplete multipartite digraphs
We consider the problem (MSSS) of finding the minimum number of arcs in a spanning strongly connected subgraph of a strongly connected digraph. This problem is NP-hard for general digraphs since it generalizes the hamiltonian cycle problem. We characterize the number of arcs in a minimum spanning strong subgraph for digraphs which are either extended semicomplete or semicomplete bipartite. Our ...
متن کاملQuasi-hamiltonian paths in semicomplete multipartite digraphs
A quasi-hamiltonian path in a semicomplete multipartite digraph D is a path which visits each maximal independent set (also called a partite set) of D at least once. This is a generalization of a hamiltonian path in a tournament. In this paper we investigate the complexity of finding a quasi-hamiltonian path, in a given semicomplete multipartite digraph, from a prescribed vertex x to a prescrib...
متن کاملPaths and cycles in extended and decomposable digraphs,
We consider digraphs – called extended locally semicomplete digraphs, or extended LSD’s, for short – that can be obtained from locally semicomplete digraphs by substituting independent sets for vertices. We characterize Hamiltonian extended LSD’s as well as extended LSD’s containing Hamiltonian paths. These results as well as some additional ones imply polynomial algorithms for finding a longes...
متن کاملSuucient Conditions for Semicomplete Multipartite Digraphs to Be Hamiltonian Dedicated to Professor Dr. Horst Sachs on His 70th Birthday
A semicomplete multipartite digraph is obtained by replacing each edge of a complete multipartite graph by an arc or by a pair of two mutually opposite arcs. Very recently, Yeo 7] proved that every regular semicomplete multipartite digraph is Hamiltonian. With this, Yeo connrmed a conjecture of C.-Q. Zhang 8]. In the rst part of this paper, a generalization of regularity is considered. We exten...
متن کاملLocal Tournaments and In - Tournaments
Preface Tournaments constitute perhaps the most well-studied class of directed graphs. One of the reasons for the interest in the theory of tournaments is the monograph Topics on Tournaments [58] by Moon published in 1968, covering all results on tournaments known up to this time. In particular, three results deserve special mention: in 1934 Rédei [60] proved that every tournament has a directe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 313 شماره
صفحات -
تاریخ انتشار 2013